• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º

Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) °ø°£ È¿À²ÀûÀÎ DNA ½ÃÄö½º Àε¦½Ì ¹æ¾È
¿µ¹®Á¦¸ñ(English Title) A Space Efficient Indexing Technique for DNA Sequences
ÀúÀÚ(Author) ¼ÛÇýÁÖ   ¹Ú¿µÈ£   ³ë¿õ±â   Hye-Ju Song   Young-Ho Park   Woong-Kee Loh  
¿ø¹®¼ö·Ïó(Citation) VOL 36 NO. 06 PP. 0455 ~ 0465 (2009. 12)
Çѱ۳»¿ë
(Korean Abstract)
¼­ÇȽº Æ®¸®´Â °øÅëÀÇ ÇÁ¸®ÇȽºÀÇ ºóµµ¼ö°¡ ³ôÀ» ¶§ È¿°úÀûÀÎ ¾Ë°í¸®ÁòÀ¸·Î, ÇÑÁ¤µÈ ¹®Àڷθ¸ ±¸¼ºµÈ DNA À¯»ç¼º °Ë»öÀ» À§ÇÑ ¿¬±¸¿¡¼­ ³Î¸® È°¿ëµÇ°í ÀÖ´Ù. ±×·¯³ª, ¼­ÇȽº Æ®¸®´Â À妽º Ư¼º »ó ¸Þ¸ð¸® °ø°£À» ¸¹ÀÌ Â÷ÁöÇϸç, Æ®¸®ÀÇ ºÐÇÒ ½Ã DNA ½ÃÄö½ºÀÇ ºñÀ²·Î ÀÎÇÑ ½ò¸²Çö»óÀÌ ¹ß»ýÇÑ´Ù´Â ¹®Á¦Á¡À» °¡Áø´Ù. µû¶ó¼­, º» ³í¹®¿¡¼­´Â °øÅëÀÇ ÇÁ¸®ÇȽº¸¦ °¡Áö´Â °¡º¯±æÀÌÀÇ ÆÄƼ¼Å´× ¹æ¹ýÀ¸·Î ÇÕº´ÇÏÁö ¾Ê´Â Àε¦½Ì ¹æ¾ÈÀÎ SENoMÀ» Á¦¾ÈÇÑ´Ù. SENoMÀº Àüü ½ÃÄö½º¿¡¼­ °øÅëÀÇ ÇÁ¸®ÇȽº¸¦ °¡Áö´Â ¼­ÇȽºµéÀÇ ¹ß»ý ºóµµ¼ö°¡ ÀÓ°èÄ¡ ÀÌÇÏÀÎ °æ¿ì µð½ºÅ©¿¡ ÀúÀåÇÏ°í, ÀÓ°èÄ¡ ÀÌ»óÀÎ °æ¿ì ÀÓ°èÄ¡ ÀÌÇÏ°¡ µÉ ¶§±îÁö ÇÁ¸®ÇȽº¸¦ È®ÀåÇÑ´Ù. ¸ðµç ÆÄƼ¼ÇÀº ¼­ºêÆ®¸®·Î ±¸ÃàÇÑ ÈÄ µð½ºÅ©¿¡ ÀúÀåÇϸç, ÁúÀÇ󸮸¦ À§ÇØ, ±¸ÃàµÈ ÆÄƼ¼ÇÀÇ ÇÁ¸®ÇȽº¸¦ ¼­ÇȽº·Î °¡Áö´Â Æ®¸®¸¦ ±¸ÃàÇÑ´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀº º¹ÀâÇÑ ÇÕº´°úÁ¤À» Á¦°ÅÇÏ°í, ¸¹Àº ÆÄƼ¼Ç ¹ß»ýÀ¸·Î ÀÎÇÑ µð½ºÅ© I/O ¹ß»ýÀ» ÁÙÀδÙ. ½ÇÇèÀ» ÅëÇØ, SENoMÀÌ Trellis ¾Ë°í¸®Áò¿¡ ºñÇØ ¸Þ¸ð¸® »ç¿ë·®À» ¾à 35%, À妽º Å©±â¸¦ ¾à 20% °¨¼Ò½ÃÄ×À½À» º¸ÀδÙ. ¶ÇÇÑ, ÁúÀDZæÀÌ°¡ ±ä °æ¿ì¿¡µµ ÇÁ¸®ÇȽº Æ®¸®¸¦ ÀÌ¿ëÇÏ¿© È¿°úÀûÀÎ ÁúÀÇ󸮰¡ °¡´ÉÇÔÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.
Å°¿öµå(Keyword) ¼­ÇȽº Æ®¸®   °¡º¯±æÀÌ ÇÁ¸®ÇȽº   Suffix Tree   Variable-length prefix  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå